Modern Cooperative Parallel SAT Solving
نویسندگان
چکیده
Nowadays, powerful parallel SAT solvers are based on an algorithm portfolio. The alternative approach, (iterative) search space partitioning, cannot keep up, although, according to the literature, iterative partitioning systems should scale better than portfolio solvers. This rises often! In this paper we identify key problems in current parallel cooperative SAT solving approaches, most importantly communication, how to partition the search space, and how to utilize the sequential search engine. First, we improve on each problem separately. In a further step, we show that combining all the improvements leads to a state-of-the-art parallel SAT solver, which does not use the portfolio approach, but instead relies on iterative partitioning. The experimental evaluation of this system completely changes the picture about the performance of search space partitioning SAT solvers: on instances of a combined benchmark of recent SAT competitions, the presented approach can keep up with the winners of last years SAT competition. The combined improvements improve the existing cooperative solver splitter by 24%: instead of 561 out of 880 instances, the new solver Pcasso can solve 696 instances.
منابع مشابه
Control-Based Clause Sharing in Parallel SAT Solving
Conflict driven clause learning, one of the most important component of modern SAT solvers, is also recognized as very important in parallel SAT solving. Indeed, it allows clause sharing between multiple processing units working on related (sub)problems. However, without limitation, sharing clauses might lead to an exponential blow up in communication or to the sharing of irrelevant clauses. Th...
متن کاملParallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in parallel on a single processor. Techniques such as random sampling demonstrate that while using bit vectors instead of Boolean values solutions to satisfiable formulae can be obtained faster. Here, we reveal that more ...
متن کاملAlgorithm Configuration for Portfolio-based Parallel SAT-Solving
Since 2004, the increases in processing power enabled by Moore’s law have been primarily achieved by means of multi-core processor architectures. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for SAT, one of the most widely studied NP...
متن کاملDiversification and Intensification in Parallel SAT Solving
In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an important role in several search algorithms including local search, and appear to be a key point in modern parallel SAT solvers. To study their tradeoff, we define two roles for the computational units. Some of them classified as Mas...
متن کاملAutomatic construction of parallel portfolios via algorithm configuration
Since 2004, increases in computational power described by Moore’s law have substantially been realized in the form of additional cores rather than through faster clock speeds. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for proposit...
متن کامل